Constructing higher-order hydrodynamics: The third order
نویسندگان
چکیده
منابع مشابه
Constructing a Third-Order Linear Differential Equation
In this paper, using the approach of Hurwitz and the necessary conditions given in 4,6], we construct a third order linear diierential equation whose diierential Galois group is the primitive subgroup F SL3 36 S L(3; C) of order 108.
متن کاملInvestigating the Third Order Solitary Wave Generation Accuracy using Incompressible Smoothed Particle Hydrodynamics
This paper examines the generation and propagation of a Third order solitary water wave along the channel. First the Incompressible Smoothed Particle Hydrodynamics (ISPH) numerical method is described and the boundary condition handling method is presented. The numerical model is then used to simulate solitary wave propagation along the fixed depth channel. The numerical results are compared wi...
متن کاملConstructing higher-order Voronoi diagrams in parallel
We use Lee’s sequential algorithm [17] to create the first parallel algorithm which constructs the order-k Voronoi diagram of a planar point set. The algorithm is developed and analyzed within two parallel models, the fine-grained PRAM and the coarse-grained CGM. Its applications include k-nearest neighbor searches in a parallel context, which are important for many applications in computationa...
متن کاملConstructing Logic Programs with Higher-Order Predicates
This paper proposes a logic programming approach based on the application of a system of higher-order predicates put at disposal within ordinary logic programming languages such as prolog. These higher-order predicates parallel the higher-order functionals or combinators which form an established part of contemporary functional programming methodology. The suggested toolbox of higher-order pred...
متن کاملConstructing Levels in Arrangements and Higher Order Voronoi Diagrams 1 Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n hyperplanes in two-and three-dimensional space. The expected running time of our algorithms is O(nk + nn(n) log n) for the planar case, and O(nk 2 + n log 3 n) for the three-dimensional case. Both bounds are optimal unless k is very small. The algorithm generalizes to computing the k-level in an ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review D
سال: 2016
ISSN: 2470-0010,2470-0029
DOI: 10.1103/physrevd.93.066012